Informatics Publishing Limited

P. Jesu Jayarin ¹, T. Ravi ²

Affiliations
1 CSE Department, Sathyabama University, Chennai-600119, IN
2 Department of CSE, KCG College of Technology, Chennai-600097, IN

Abstract

In multi-hop cellular networks, a channel that contributes the lowest relaying delay is proposed to the current node on the path. The current node itself does not receiving on the time-slot of the proposed channel that enhance the capacity and coverage problems of cellular networks. They also allow faster and cheaper deployment of cellular networks. A fundamental issue of these networks is packet delay because multi-hop relaying for signals is involved. An effective channel assignment is the key for the reducing delay. It proposes an optimal and a heuristic channel assignment scheme, called OCA and minimum slot waiting first (MSWF) respectively, for a time division duplex (TDD) wideband code division multiple access (W-CDMA) MCN. OCA provides an optimal solution in minimizing packet delay and can be used as an unbiased or benchmark tool for comparison among different network conditions or networking schemes. However, OCA is computationally expensive and thus, inefficient for large real-time channel assignment problem. In this case, MSWF is more appropriate. Simulation results show that MSWF achieves on average 95% of the delay performance of OCA and is effective in achieving high throughput and low packet delay in conditions of different cell sizes. For improving more on quality of service we can propose channel reuse. Using FDMA and TDMA we can reuse the channels. The novel feature of the proposed technique is that co-coordinated, prioritized TDMA is supported for clusters of access points (AP's) using measurement based time slot assignments.

Keywords

Cellular Network, MSWF, CSMA, OCA, Channel Assignment

Full Text

   

P. Jesu Jayarin , T. Ravi

Abstract

In cellular networks, it is vital to allocate communication channels efficiently because the bandwidth allocated for cellular communication is limited. When mobile hosts move from one cell to another cell, to provide uninterrupted service, the new cell should have enough channels to support the ongoing communication of the mobile hosts that moved into the cell. If channels are statically allocated, a cell may run out of channels when large number of mobile hosts moves to a cell, thus degrading the quality of service. To overcome this problem, dynamic channel allocation approaches have been proposed which allocate channels to cells on demand, thus increasing channel utilization and hence improving the quality of service. A distributed dynamic channel allocation algorithms gained a lot of attention due to their high reliability and scalability. The cell that wants to borrow a channel has to wait for replies from all its interference neighbors and hence, is not fault-tolerant. This work aims to propose a Distributed dynamic channel allocation algorithm to make use of the available channel efficiently. It can tolerate the failure of mobile nodes as well as static nodes and enhance the quality of service by making efficient reuse of channels. This paper proposes a channel allocation scheme with efficient bandwidth reservation, which initially reserves some channels for handoff calls, and later reserves the channels dynamically, based on the user mobility The results indicate that the proposed channel allocation scheme exhibits better performance by considering the above mentioned user mobility, type of cells, and maintaining of the queues for various traffic sources. In addition, it can be observed that our approach reduces the dropping probability by using reservation factor.

Full Text

     

P. Jesu Jayarin ¹, T. Ravi ²

Affiliations
1 Sathyabama University, Chennai-119
2 Department of CSE, KCG College of Technology, Chennai, IN

Abstract

In this paper we use the randomized algorithm for solving the channel allocation problem in the network. Minimum Slot Waiting First (MSWF) is used for overcome the problem which is caused by randomized algorithm, where the node whose is not first prioritized because it allocates the channel randomly. By using channel reuse technique we can improve the quality of service. Then we reuse the channel by using the given methods FDMA and TDMA.Here we propose an optimal channel allocation scheme which can give the best performance for improving the Quality of service and throughput. By using the given technique multihop cooperative transmission, the system throughput can be improved. The multiple expand path links reduces outage probability. Channel allocation architecture provides better reliability and maintains cell capacity for high bandwidth using throughput values. The channel assignment problem in a class of wireless cellular networks form as such regular grids which can be obtained by adding two edges to connect two pair of diagonal vertices of every square cell in the square grids. Simulation results show that allocation algorithm is effective to improve the bandwidth efficiency of the networks.

Keywords

Channel Allocation, Frequency Reuse, MSWF and Throughput Calculation.

Full Text